Kunne det vært oss?

The Norwegian type-anaphor det

This paper gives a description of the Norwegian type anaphor det ('that') and proposes a formal representation of it in the HPSG framework. This identity-of-sense anaphor is interpreted as referring to a (new) set of entities of the same type as its antecedent. Its antecedent has to be either indefinite or a definite NP that is likely to introduce a brand new discourse referent. Whereas the typ...

OSS Factory: Development Model Based at OSS Practices

In this paper we present OSS Factory (Open Source Software Factory), an ecosystem aligning software demands, undergraduate Computing students qualification and Open Software practices in a collaborating relation, dedicated to produce open software applications to cope with market demands, using students coding potential. A contest among students attending software engineering courses (or volunt...

Det-extremal cubic bipartite graphs

Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...

Det-Det Correlations for Quantum Maps: Dual Pair and Saddle-Point Analyses

An attempt is made to clarify the ballistic non–linear sigma model formalism recently proposed for quantum chaotic systems, by looking at the spectral determinant Z(s) = Det(1− sU) for quantized maps U ∈ U(N), and studying the correlator ωU (s) = ∫ dθ |Z(eiθs)|2. By identifying U(N) as one member of a dual pair acting in the spinor representation of Spin(4N), the expansion of ωU (s) in powers o...

NESSI OSS Workshop